Search results for "Genetic algorithms"

showing 10 items of 38 documents

Using Genetic Algorithms for Optimizing the PPC in the Highway Horizontal Alignment Design.

2016

Various studies have emphasized the interesting advantages related to the use of new transition curves for improving the geometric design of highway horizontal alignments. In a previous paper, one of the writers proposed a polynomial curve, called a polynomial parametric curve (PPC), proving its efficiency in solving several design problems characterized by a very complex geometry (egg-shaped transition, transition between reversing circular curves, semidirect and inner-loop connections, and so on). The PPC also showed considerable advantages from a dynamic perspective, as evidenced by the analysis of the main dynamic variables related to motion (as well as rate of change of radial accelera…

050210 logistics & transportationPolynomialMathematical optimizationFitness function05 social sciencesPerspective (graphical)Motion (geometry)020101 civil engineering02 engineering and technologyTransition curve0201 civil engineeringComputer Science ApplicationsGeometric designComplex geometryGenetic algorithmGenetic algorithms Horizontal alignment Polynomial curve Transition curve0502 economics and businessHorizontal alignment.Polynomial curveSettore ICAR/04 - Strade Ferrovie Ed AeroportiReversingParametric equationAlgorithmCivil and Structural EngineeringMathematics
researchProduct

Soundscape design through evolutionary engines

2008

Abstract Two implementations of an Evolutionary Sound Synthesis method using the Interaural Time Difference (ITD) and psychoacoustic descriptors are presented here as a way to develop criteria for fitness evaluation. We also explore a relationship between adaptive sound evolution and three soundscape characteristics: keysounds, key-signals and sound-marks. Sonic Localization Field is defined using a sound attenuation factor and ITD azimuth angle, respectively (Ii, Li). These pairs are used to build Spatial Sound Genotypes (SSG) and they are extracted from a waveform population set. An explanation on how our model was initially written in MATLAB is followed by a recent Pure Data (Pd) impleme…

sonic spatializationeducation.field_of_studySoundscapesound synthesisGeneral Computer Scienceartificial evolutionComputer scienceSpeech recognitionacoustic descriptorsPopulationEvolutionary algorithmInteraural time differencegenetic algorithmsPure DataPsychoacousticseducationcomputerAcoustic attenuationParametric statisticscomputer.programming_languageComputer Science(all)
researchProduct

An evolutionary restricted neighborhood search clustering approach for PPI networks

2014

Protein-protein interaction networks have been broadly studied in the last few years, in order to understand the behavior of proteins inside the cell. Proteins interacting with each other often share common biological functions or they participate in the same biological process. Thus, discovering protein complexes made of a group of proteins strictly related can be useful to predict protein functions. Clustering techniques have been widely employed to detect significant biological complexes. In this paper, we integrate one of the most popular network clustering techniques, namely the Restricted Neighborhood Search Clustering (RNSC), with evolutionary computation. The two cost functions intr…

Computer sciencebusiness.industryCognitive NeuroscienceNeighborhood searchComputational biologyPPI networks clusteringGenetic algorithmsMachine learningcomputer.software_genreBudding yeastEvolutionary computationComputer Science ApplicationsOrder (biology)Artificial IntelligenceGenetic algorithmArtificial intelligenceEvolutionary approachesbusinessCluster analysiscomputerProtein-protein interaction networks clustering
researchProduct

System identification via optimised wavelet-based neural networks

2003

Nonlinear system identification by means of wavelet-based neural networks (WBNNs) is presented. An iterative method is proposed, based on a way of combining genetic algorithms (GAs) and least-square techniques with the aim of avoiding redundancy in the representation of the function. GAs are used for optimal selection of the structure of the WBNN and the parameters of the transfer function of its neurones. Least-square techniques are used to update the weights of the net. The basic criterion of the method is the addition of a new neurone, at a generic step, to the already constructed WBNN so that no modification to the parameters of its neurones is required. Simulation experiments and compa…

least squares approximations nonlinear dynamical systems identification neural nets iterative methods genetic algorithmsQuantitative Biology::Neurons and CognitionArtificial neural networkNonlinear system identificationIterative methodComputer scienceSystem identificationTransfer functionWaveletSettore ING-INF/04 - AutomaticaControl and Systems EngineeringControl theoryRedundancy (engineering)Electrical and Electronic EngineeringRepresentation (mathematics)InstrumentationAlgorithmIEE Proceedings - Control Theory and Applications
researchProduct

A multi-objective genetic algorithm for the passenger maritime transportation problem

2014

Over the last years, the transportation demand has continuously increased and a further growth is predicted for the next future especially as regards the maritime sector. As a consequence, shipping companies will be asked to improve the supplied services in order to assure a high quality and time-effective goods and passengers transportation, deriving at the same time their own benefits by minimizing costs. Therefore, the optimization of routes and schedules together with the fleet deployment take a meaningful role on companies profitability and efficiency. In such a perspective, the present paper proposes a multi-objective mathematical programming model to determine a set of routes and sch…

Transportation Routing Scheduling Fleet Sizing Genetic Algorithms
researchProduct

RepeatsDB 2.0: improved annotation, classification, search and visualization of repeat protein structures

2017

RepeatsDB 2.0 (URL: http://repeatsdb.bio.unipd.it/) is an update of the database of annotated tandem repeat protein structures. Repeat proteins are a widespread class of non-globular proteins carrying heterogeneous functions involved in several diseases. Here we provide a new version of RepeatsDB with an improved classification schema including high quality annotations for ∼5400 protein structures. RepeatsDB 2.0 features information on start and end positions for the repeat regions and units for all entries. The extensive growth of repeat unit characterization was possible by applying the novel ReUPred annotation method over the entire Protein Data Bank, with data quality is guaranteed by a…

0301 basic medicineRepetitive Sequences Amino Acid[SDV.BC]Life Sciences [q-bio]/Cellular BiologyBiologyBioinformaticsSearch engineAnnotationStructure-Activity Relationship03 medical and health sciences0302 clinical medicineTandem repeatGeneticsAnimalsHumansDatabase IssueDatabases ProteinComputingMilieux_MISCELLANEOUSRepeat unit030304 developmental biology0303 health sciencesInformation retrievalProteinscomputer.file_formatProtein Data BankVisualizationSchema (genetic algorithms)030104 developmental biologyData qualityCorrigendumcomputerSoftware030217 neurology & neurosurgeryNucleic Acids Research
researchProduct

Embedding Evolution in Epidemic-Style Forwarding

2007

International audience; In this work, we introduce a framework to let forwarding schemes evolve in order to adapt to changing and a priori unknown environments. The framework is inspired by genetic algorithms: at each node a genotype describes the forwarding scheme used, a selection process fosters the diffusion of the fittest genotypes in the system and new genotypes are created by combining existing ones or applying random changes. A case study implementation is presented and its performance evaluated via numerical simulations.

Scheme (programming language)Theoretical computer scienceComputer scienceSurvival of the fittestNode (networking)Quality control and genetic algorithmsProcess (computing)Quantitative Biology::Genomics[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]EmbeddingQuantitative Biology::Populations and EvolutioncomputerSelection (genetic algorithm)computer.programming_language
researchProduct

'SMART laser', Development of laser sources integrating an optimized functioning via a process of learning

2022

Ost commercially available mode-blocking lasers provide a unique pulse regime to the user, driven only by a simple switch. To solve certain problems, it would be advantageous to increase the possibilities of pulse adjustment in many areas of application, from micro-machining to wavelength conversion. One way to increase the degrees of freedom of a laser cavity is to incorporate into it a saturable absorbant with adjustable parameters, as with non-linear polarization evolution devices (NPEs). The absence of an analytical relationship between the adjustable cavity parameters and the characteristics of a generated pulse can be circumvented by the use of scalable algorithms, well suited to mult…

OptimizationFibre[PHYS.PHYS.PHYS-OPTICS] Physics [physics]/Physics [physics]/Optics [physics.optics]LaserAlgorithme d'évolutionOptimisationFiberImpulsions ultracourtesGenetic algorithmsUltrashort pulses
researchProduct

Identification of Key miRNAs in Regulation of PPI Networks

2020

In this paper, we explore the interaction between miRNA and deregulated proteins in some pathologies. Assuming that miRNA can influence mRNA and consequently the proteins regulation, we explore this connection by using an interaction matrix derived from miRNA-target data and PPI network interactions. From this interaction matrix and the set of deregulated proteins, we search for the miRNA subset that influences the deregulated proteins with a minimum impact on the not deregulated ones. This regulation problem can be formulated as a complex optimization problem. In this paper, we have tried to solve it by using the Genetic Algorithm Heuristic. As the main result, we have found a set of miRNA…

Settore ING-INF/05 - Sistemi Di Elaborazione Delle Informazioni0301 basic medicineOptimization problemSettore INF/01 - InformaticaHeuristic (computer science)Computer sciencemiRNA expression profiles Protein-protein interaction networks Genetic algorithmsComputational biologyGenetic algorithmsmiRNA expression profilesProtein-protein interaction networks03 medical and health sciencesIdentification (information)030104 developmental biologyPpi networkGenetic algorithmmicroRNAKey (cryptography)Set (psychology)
researchProduct

Genetic Normalized Convolution

2011

Normalized convolution techniques operate on very few samples of a given digital signal and add missing information, trough spatial interpolation. From a practical viewpoint, they make use of data really available and approximate the assumed values of the missing information. The quality of the final result is generally better than that obtained by traditional filling methods as, for example, bilinear or bicubic interpolations. Usually, the position of the samples is assumed to be random and due to transmission errors of the signal. Vice versa, we want to apply normalized convolution to compress data. In this case, we need to arrange a higher density of samples in proximity of zones which c…

Phase congruencyCorrectnessSettore INF/01 - InformaticaPosition (vector)Genetic algorithmGenetic Algorithms Normalized Convolution Symmetry Transform Structural Similarity Metrics Phase CongruencyBicubic interpolationBilinear interpolationDigital signal (signal processing)AlgorithmMathematicsMultivariate interpolation
researchProduct